Maximin, Discounting, and Separating Hyperplanes

نویسندگان

  • CEES WITHAGEN
  • GEIR B. ASHEIM
  • C. WITHAGEN
  • G. B. ASHEIM
  • W. BUCHHOLZ
چکیده

Is Hartwick’s rule a necessary condition for maximin in Solow’s [1974] model? Until recently this has been an open question; this is surprising given the prominence of the model. Cairns and Yang [2000] as well as Withagen, Asheim and Buchholz (this issue) claim that the answer is in the affirmative and claim to provide a formal proof. The latter team argues that the proof by the former is not correct and provides an alternative proof, based on Withagen and Asheim [1998]. Although Cairns and Yang [2000] assert that the methodology of Withagen and Asheim [1998] is “contrived”, our proof in this issue is not in dispute. This settles the question: Hartwick’s rule is necessary in Solow’s model. Nevertheless there is continued controversy. The main point in Cairns’ reply in this issue refers to discounting. In Withagen and Asheim it is assumed (in a very general setting) that an efficient constant utility path is supported by positive utility discount factors

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficiency Analysis Based on Separating Hyperplanes for Improving Discrimination among DMUs

Data envelopment analysis (DEA) is a non-parametric method for evaluating the relative technical efficiency for each member of a set of peer decision making units (DMUs) with multiple inputs and multiple outputs. The original DEA models use positive input and output variables that are measured on a ratio scale, but these models do not apply to the variables in which interval scale data can appe...

متن کامل

Constructively Learning a Near-Minimal Neural Network Architecture

AbetractRather than iteratively manually examining a variety of pre-specified architectures, a constructive learning algorithm dynamically creates a problem-specific neural network architecture. Here we present an revised version of our parallel constructive neural network learning algorithm which constructs such an architecture. The three steps of searching for points on separating hyperplanes...

متن کامل

The zero discounting and maximin optimal paths in a simple model of global warming

Following Stollery (1998), we extend the Solow– Dasgupta–Heal model to analyze the e¤ects of global warming The rise of temperature is caused by the use of fossil resources so that the temperature level can be linked to the remaining stock of these resources. The rise of temperature a¤ects both productivity and utility. We characterize optimal solutions for the maximin and zero-discounting case...

متن کامل

NOKMeans: Non-Orthogonal K-means Hashing

Finding nearest neighbor points in a large scale high dimensional data set is of wide interest in computer vision. One popular and efficient approach is to encode each data point as a binary code in Hamming space using separating hyperplanes. One condition which is often implicitly assumed is that the separating hyperplanes should be mutually orthogonal. With the aim of increasing the represent...

متن کامل

Valuing future life and future lives: A framework for understanding discounting

This article offers a conceptual framework for separating the distinct theoretical concepts that are often confounded in discussions of discounting. Two distinctions are emphasized: (a) the difference between discounting a future outcome because it confers less utility and discounting future utility per se, and (b) the differences between discounting one’s own future utility and discounting the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003